Set function

Results: 1102



#Item
871Mathematics / Theory of computation / Blum axioms / Computable function / ELEMENTARY / Recursively enumerable set / Smn theorem / Computational complexity theory / Lambda calculus / Theoretical computer science / Computability theory / Applied mathematics

The Intensional Content of Rice’s Theorem (Pearl) Andrea Asperti Department of Computer Science, University of Bologna Mura Anteo Zamboni 7, 40127, Bologna, ITALY [removed]

Add to Reading List

Source URL: www.cs.unibo.it

Language: English - Date: 2007-10-31 03:46:45
872Injective function / Galois connection / Equivalence relation / Surjective function / Function / Bijection / Monotonic function / Restriction / Inverse function / Mathematics / Mathematical analysis / Functions and mappings

Foundations of mathematics Sylvain Poirier settheory.net 2. Set theory (continued[removed]Tuples, families

Add to Reading List

Source URL: settheory.net

Language: English - Date: 2014-02-21 17:52:19
873Mathematics / Computer science / Turing reduction / Low / Computable function / Turing degree / Function / Recursive set / Enumeration / Computability theory / Theoretical computer science / Theory of computation

Π01 CLASSES AND STRONG DEGREE SPECTRA OF RELATIONS JOHN CHISHOLM, JENNIFER CHUBB, VALENTINA S. HARIZANOV, DENIS R. HIRSCHFELDT, CARL G. JOCKUSCH, JR., TIMOTHY MCNICHOLL, AND SARAH PINGREY Abstract. We study the weak tru

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2009-07-29 17:57:30
874Mathematics / Computer science / Computable function / Recursive set / Computation in the limit / Generic-case complexity / Turing reduction / Halting problem / Blum axioms / Computability theory / Theoretical computer science / Theory of computation

GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in the context of cl

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2013-02-15 20:06:55
875Mathematics / Computer science / Computable function / Recursive set / Recursively enumerable set / Enumeration / Generic-case complexity / Halting problem / Low / Computability theory / Theory of computation / Theoretical computer science

ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS RODNEY G. DOWNEY, CARL G. JOCKUSCH, JR., AND PAUL E. SCHUPP Abstract. We study connections between classical asymptotic density, computability and computable enumerabilit

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2013-07-19 19:14:33
876Social issues / Submodular set function / Internet privacy / Information privacy / Ln / Risk / Ethics / Privacy / Identity management

Stochastic Privacy Adish Singla∗ Eric Horvitz Ece Kamar

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2014-04-23 07:46:33
877Applied mathematics / Computable function / Turing reduction / Reduction / Algorithmically random sequence / Function / Computability theory / Mathematics / Computer science

DIAGONALLY NON-COMPUTABLE FUNCTIONS AND BI-IMMUNITY CARL G. JOCKUSCH, JR. AND ANDREW E.M. LEWIS Abstract. We prove that every diagonally noncomputable function computes a set A which is bi-immune, meaning that neither A

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2013-02-02 15:47:48
878Metric geometry / Topology / Metric space / Continuous function / Convex function / Derivative / Infinite-dimensional holomorphy / Inner product space / Mathematical analysis / Mathematics / Functional analysis

J. Math. Anal. Appl[removed]–20 www.elsevier.com/locate/jmaa Set-valued versions of Ky Fan’s inequality with application to variational inclusion theory Alexandru Kristály ∗ and Csaba Varga 1

Add to Reading List

Source URL: adatbank.transindex.ro

Language: English - Date: 2010-02-16 17:34:37
879Mathematics / Computable function / Algorithmically random sequence / Busy beaver / Theory of computation / Computability theory / Applied mathematics

ASYMPTOTIC DENSITY, COMPUTABLE TRACEABILITY, AND 1-RANDOMNESS URI ANDREWS, MINGZHONG CAI, DAVID DIAMONDSTONE, CARL JOCKUSCH, AND STEFFEN LEMPP Abstract. Let r be a real number in the unit interval [0, 1]. A set A ⊆ ω

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2014-02-03 11:22:22
880Structure / Order theory / Supermodular function / Kullback–Leibler divergence / Internet privacy / Privacy / Mathematical optimization / Submodular set function / Ethics

Journal of Artificial Intelligence Research[removed]662 Submitted 05/10; published[removed]A Utility-Theoretic Approach to Privacy in Online Services Andreas Krause

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2011-01-25 14:56:42
UPDATE